Estimating and understanding exponential random graph models
نویسندگان
چکیده
منابع مشابه
Exponential random graph models
Synonyms p* models, p-star models, p1 models, exponential family of random graphs, maximum entropy random networks, logit models, Markov graphs Glossary • Graph and network: the terms are used interchangeably in this essay. • Real-world network: (real network, observed network) means network data the researcher has collected and is interested in modelling. • Ensemble of graphs: means the set of...
متن کاملEstimating Temporal Exponential Random Graph Models by Bootstrapped Pseudolikelihood
This package vignette is designed as a hands-on tutorial for estimating temporal exponential random graph models (TERGMs) (Desmarais and Cranmer 2010, 2012b; Hanneke et al. 2010) and assessing goodness of fit and predictive performance (Cranmer and Desmarais 2011; Leifeld and Cranmer 2014) using the xergm package (Leifeld et al. 2014) for the statistical computing environment R (R Core Team 201...
متن کاملLearning Exponential Random Graph Models
Exponential Random Graphs are common, simple statistical models for social network and other structures. Unfortunately, inference and learning with them is hard for networks larger than 20 nodes because their partition functions are intractable to compute precisely. In this paper, we introduce a novel linear-time deterministic approximation to these partition functions. Our main insight enablin...
متن کاملAdvances in exponential random graph (p*) models
Editorial Advances in exponential random graph (p *) models Statistical approaches to social networks have a rather long history. Few now recall that Moreno and Jennings (1938) in the very first edition of Sociometry compared an observed network against a null distribution of graphs to investigate the prevalence of what they called social configurations (long before the much later terms motif o...
متن کاملNew Specifications for Exponential Random Graph Models
The most promising class of statistical models for expressing structural properties of social networks observed at one moment in time is the class of exponential random graph models (ERGMs), also known as p ∗ models. The strong point of these models is that they can represent a variety of structural tendencies, such as transitivity, that define complicated dependence patterns not easily modeled...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Annals of Statistics
سال: 2013
ISSN: 0090-5364
DOI: 10.1214/13-aos1155